skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Richter, Florian K"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, International mathematics research notices)
    Accepted Manuscript Full Text Available
  2. ; ; (, Mathematical Research Letters)
    In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on systems where translates of targets exhibit near perfect mutual independence, such as Bernoulli schemes and the Gauß map. For such systems, we present tight conditions on the shrinking rate of the targets so that the set of eventually always hitting points is a null set (or co-null set respectively). 
    more » « less
    Full Text Available 
  3. ; ; (, Annals of mathematics)
    In this paper we show that every set A⊂ℕ with positive density contains B+C for some pair B,C of infinite subsets of ℕ, settling a conjecture of Erd\H os. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups. 
    more » « less
    Accepted Manuscript Full Text Available